Geodesics in CAT(0) cubical complexes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geodesics in CAT(0) Cubical Complexes

We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature and posets with inconsistent pairs. This correspondence also gives an explicit realization of such a complex as the state complex of a reconfigurable system, and a way to embed any interval in the integer lattice cubi...

متن کامل

A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes

This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Owen and Provan’s algorithm (2011) as a subroutine. Our algorithm is applicable to any CAT(0) space in which geodesics between two close points can be computed, not limit...

متن کامل

Edge Expansion of Cubical Complexes

In this paper we show that graphs of “neighbourly” cubical complexes – cubical complexes in which every pair of vertices spans a (unique) cube – have good expansion properties, using a technique based on multicommodity flows. By showing that graphs of stable set polytopes are graphs of neighbourly cubical complexes we give a new proof that graphs of stable set polytopes have edge expansion 1.

متن کامل

Graphs of Acyclic Cubical Complexes

It is well known that chordal graphs are exactly the graphs of acyclic simplicial complexes . In this note we consider the analogous class of graphs associated with acyclic cubical complexes . These graphs can be characterized among median graphs by forbidden convex subgraphs . They possess a number of properties (in analogy to chordal graphs) not shared by all median graphs . In particular , w...

متن کامل

Surface Thinning in 3D Cubical Complexes

We introduce a parallel thinning algorithm with directional substeps based on the collapse operation, which is guaranteed to preserve topology and to provide a thin result. Then, we propose two variants of a surface-preserving thinning scheme, based on this parallel directional thinning algorithm. Finally, we propose a methodology to produce filtered surface skeletons, based on the above thinni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2012

ISSN: 0196-8858

DOI: 10.1016/j.aam.2011.06.004